space complexity - определение. Что такое space complexity
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое space complexity - определение

AMOUNT OF MEMORY SPACE REQUIRED TO SOLVE AN INSTANCE OF THE COMPUTATIONAL PROBLEM AS A FUNCTION OF THE SIZE OF THE INPUT
Memory complexity
Найдено результатов: 3242
space complexity         
<complexity> The way in which the amount of storage space required by an algorithm varies with the size of the problem it is solving. Space complexity is normally expressed as an order of magnitude, e.g. O(N^2) means that if the size of the problem (N) doubles then four times as much working storage will be needed. See also computational complexity, time complexity. (1996-05-08)
Space complexity         
The space complexity of an algorithm or a computer program is the amount of memory space required to solve an instance of the computational problem as a function of characteristics of the input. It is the memory required by an algorithm until it executes completely.
Asymptotic computational complexity         
IN THEORY OF COMPUTATION
Asymptotic time complexity; Asymptotic space complexity
In computational complexity theory, asymptotic computational complexity is the usage of asymptotic analysis for the estimation of computational complexity of algorithms and computational problems, commonly associated with the usage of the big O notation.
Computational complexity         
MEASURE OF THE AMOUNT OF RESOURCES NEEDED TO RUN AN ALGORITHM OR SOLVE A COMPUTATIONAL PROBLEM
Asymptotic complexity; Computational Complexity; Bit complexity; Context of computational complexity; Complexity of computation (bit); Computational complexities
In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements.
complexity         
PROFESSIONAL ESPORTS ORGANIZATION BASED IN THE UNITED STATES
Los Angeles Complexity; CompLexity Gaming; LA Complexity; Complexity LA; CompLexity; Team CompLexity; CoL.Black; CoL
<algorithm> The level in difficulty in solving mathematically posed problems as measured by the time, number of steps or arithmetic operations, or memory space required (called time complexity, computational complexity, and space complexity, respectively). The interesting aspect is usually how complexity scales with the size of the input (the "scalability"), where the size of the input is described by some number N. Thus an algorithm may have computational complexity O(N^2) (of the order of the square of the size of the input), in which case if the input doubles in size, the computation will take four times as many steps. The ideal is a constant time algorithm (O(1)) or failing that, O(N). See also NP-complete. (1994-10-20)
computational complexity         
MEASURE OF THE AMOUNT OF RESOURCES NEEDED TO RUN AN ALGORITHM OR SOLVE A COMPUTATIONAL PROBLEM
Asymptotic complexity; Computational Complexity; Bit complexity; Context of computational complexity; Complexity of computation (bit); Computational complexities
<algorithm> The number of steps or arithmetic operations required to solve a computational problem. One of the three kinds of complexity. (1996-04-24)
complexity         
PROFESSIONAL ESPORTS ORGANIZATION BASED IN THE UNITED STATES
Los Angeles Complexity; CompLexity Gaming; LA Complexity; Complexity LA; CompLexity; Team CompLexity; CoL.Black; CoL
Complexity is the state of having many different parts connected or related to each other in a complicated way.
...a diplomatic tangle of great complexity.
...the increasing complexity of modern weapon systems.
? simplicity
N-UNCOUNT: usu with supp
Complexity         
PROFESSIONAL ESPORTS ORGANIZATION BASED IN THE UNITED STATES
Los Angeles Complexity; CompLexity Gaming; LA Complexity; Complexity LA; CompLexity; Team CompLexity; CoL.Black; CoL
Complexity characterises the behaviour of a system or model whose components interact in multiple ways and follow local rules, leading to nonlinearity, randomness, collective dynamics, hierarchy, and emergence.
complexity         
PROFESSIONAL ESPORTS ORGANIZATION BASED IN THE UNITED STATES
Los Angeles Complexity; CompLexity Gaming; LA Complexity; Complexity LA; CompLexity; Team CompLexity; CoL.Black; CoL
n.
Intricacy, complication, entanglement, involved character.
Complexity         
PROFESSIONAL ESPORTS ORGANIZATION BASED IN THE UNITED STATES
Los Angeles Complexity; CompLexity Gaming; LA Complexity; Complexity LA; CompLexity; Team CompLexity; CoL.Black; CoL
·noun That which is complex; intricacy; complication.
II. Complexity ·noun The state of being complex; intricacy; entanglement.

Википедия

Space complexity

The space complexity of an algorithm or a computer program is the amount of memory space required to solve an instance of the computational problem as a function of characteristics of the input. It is the memory required by an algorithm until it executes completely.

Similar to time complexity, space complexity is often expressed asymptotically in big O notation, such as O ( n ) , {\displaystyle O(n),} O ( n log n ) , {\displaystyle O(n\log n),} O ( n α ) , {\displaystyle O(n^{\alpha }),} O ( 2 n ) , {\displaystyle O(2^{n}),} etc., where n is a characteristic of the input influencing space complexity.